Project scheduling optimization for contractor’s Net present value maximization using meta-heuristic algorithms: A case study

Authors

  • Iman Emami Department of Industrial Engineering, Eyvanakey University, Eyvanakey, Iran.
  • Reza Kamranrad Department of Industrial Engineering, Faculty of Engineering, Semnan University, Semnan, Iran.
Abstract:

Today's competitive conditions have caused the projects to be carried out in the least possible time with limited resources. Therefore, managing and scheduling a project is a necessity for the project. The timing of a project is to specify a sequence of times for a series of related activities. According to their priority and their latency, so that between the time the project is completed and the total cost is balanced. Given the balance between time and cost, and to achieve these goals, there are several options that should be considered among existing options and ultimately the best option to perform activities to complete the project. In this research, a mathematical model of project scheduling with multiple goals based on cost patterns and consideration of resource constraints is presented, and this problem is considered as a problem for NP-hard issues in family hybrid optimization. GA، PSO and SA Meta-heuristic algorithms are used to solve the proposed model in project scheduling and the results are compared with each other.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value

This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA).&#10In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have ...

full text

A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value

This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA). In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have be...

full text

Project Portfolio Selection with the Maximization of Net Present Value

Projects scheduling by the project portfolio selection, something that has its own complexity and its flexibility, can create different composition of the project portfolio. An integer programming model is formulated for the project portfolio selection and scheduling.Two heuristic algorithms, genetic algorithm (GA) and simulated annealing (SA), are presented to solve the problem. Results of cal...

full text

Project Scheduling with Simultaneous Optimization, Time, Net Present Value, and Project Flexibility for Multimode Activities with Constrained Renewable Resources

Project success is assessed based on various criteria, every one of which enjoys a different level of importance for the beneficiaries and decision makers. Time and cost are the most important objectives and criteria for the project success. On the other hand, reducing the risk of finishing activities until the predetermined deadlines should be taken into account. Having formulated the problem ...

full text

project portfolio selection with the maximization of net present value

projects scheduling by the project portfolio selection, something that has its own complexity and its flexibility, can create different composition of the project portfolio. an integer programming model is formulated for the project portfolio selection and scheduling.two heuristic algorithms, genetic algorithm (ga) and simulated annealing (sa), are presented to solve the problem. results of cal...

full text

Maximising the Net Present Value for Resource-Constrained Project Scheduling

The Resource-constrained Project Scheduling Problem (Rcpsp), in which a schedule must obey the resource constraints and the precedence constraints between pairs of activities, is one of the most studied scheduling problems. An important variation of the problem (RcpspDc) is to find a schedule which maximises the net present value (discounted cash flow), when every activity has a given cash flow...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 7  issue 2

pages  36- 55

publication date 2020-08-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023